Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps

نویسندگان

  • Nikolai Nøjgaard
  • Manuela Geiß
  • Daniel Merkle
  • Peter F. Stadler
  • Nicolas Wieseke
  • Marc Hellmuth
چکیده

Motivation: In the absence of horizontal gene transfer it is possible to reconstruct the historyof gene families from empirically determined orthology relations, which are equivalent to event-labeled gene trees. Knowledge of the event labels considerably simplifies the problem of recon-ciling a gene tree T with a species trees S, relative to the reconciliation problem without priorknowledge of the event types. It is well-known that optimal reconciliations in the unlabeled casemay violate time-consistency and thus are not biologically feasible. Here we investigate the math-ematical structure of the event labeled reconciliation problem with horizontal transfer.Results: We investigate the issue of time-consistency for the event-labeled version of the reconcil-iation problem, provide a convenient axiomatic framework, and derive a complete characterizationof time-consistent reconciliations. This characterization depends on certain weak conditions onthe event-labeled gene trees that reflect conditions under which evolutionary events are observ-able at least in principle. We give an O(|V (T )| log(|V (S)|))-time algorithm to decide whether atime-consistent reconciliation map exists. It does not require the construction of explicit timingmaps, but relies entirely on the comparably easy task of checking whether a small auxiliary graphis acyclic.Significance: The combinatorial characterization of time consistency and thus biologically fea-sible reconciliation is an important step towards the inference of gene family histories with hor-izontal transfer from orthology data, i.e., without presupposed gene and species trees. The fastalgorithm to decide time consistency is useful in a broader context because it constitutes an at-tractive component for all tools that address tree reconciliation problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From event-labeled gene trees with horizontal gene transfer to species trees

The history of gene families which are equivalent to event-labeled gene trees can be reconstructed from empirically estimated evolutionary event-relations containing pairs of orthologous, paralogous or xenologous genes. The question then arises as whether inferred event-labeled gene trees are biologically feasible, that is, if there is a possible true history that would explain a given gene tre...

متن کامل

A superclass of Edge-Path-Tree graphs with few cliques

Edge-Path-Tree graphs are intersection graphs of Edge-Path-Tree matrices that is matrices whose columns are incidence vectors of edge-sets of paths in a given tree. Edge-Path-Tree graphs have polynomially many cliques as proved in [4] and [7]. Therefore, the problem of finding a clique of maximum weight in these graphs is solvable in strongly polynomial time. In this paper we extend this result...

متن کامل

Exact reconciliation of undated trees

Reconciliation methods aim at recovering macro evolutionary events and at localizing them in the species history, by observing discrepancies between gene family trees and species trees. In this article we introduce an Integer Linear Programming (ILP) approach for the NP-hard problem of computing a most parsimonious time-consistent reconciliation of a gene tree with a species tree when dating in...

متن کامل

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments is amenable to the novel iterative compression technique. Moreover, we provide data reductions and problem kernels fo...

متن کامل

The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets

The maximum rooted resolved triplets consistency problem takes as input a set R of resolved triplets and asks for a rooted phylogenetic tree that is consistent with the maximum number of elements in R. This paper studies the polynomial-time approximability of a generalization of the problem where in addition to resolved triplets, the input may contain fan triplets and forbidden triplets. To beg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017